An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding
نویسندگان
چکیده
منابع مشابه
An approximate solution method based on tabu search for k-minimum spanning tree problems
This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving procedure of minimum spanning tree (MST) problems for subgraphs to obtain a local optimal solution of k-minimum spanning tree problems. This article provides a new tabu-searchbased approximate solution method that does n...
متن کاملAlignment of Minisatellite Maps: A Minimum Spanning Tree-based Approach
In addition to the well-known edit operations, the alignment of minisatellite maps includes duplication events. We model these duplications using a special kind of spanning trees and deduce an optimal duplication scenario by computing the respective minimum spanning tree. Based on best duplication scenarios for all substrings of the given sequences, we compute an optimal alignment of two minisa...
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کاملMaintaining a Minimum Spanning Tree Under Transient Node Failures
Given a 2-node connected, undirected graph G = (V,E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem of finding, for every node v ∈ V , the MST of G− v = (V \ {v}, E \ Ev), where Ev is the set of edges incident to v in G. We show that this problem can be solved in O(min(m ·α(n, n),m+ n log n)) time and O(m) space. Our ...
متن کاملGenetic algorithm approach on multi-criteria minimum spanning tree problem
Minimum Spanning Tree (MST) problem is of high importance in network optimization. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problem in the real-world, but it is diicult for the traditional network optimization technique to deal with. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. Without neglecting its network ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2021
ISSN: 1099-0526,1076-2787
DOI: 10.1155/2021/6673444